The (homological) persistence of gerrymandering
نویسندگان
چکیده
We apply persistent homology, the dominant tool from field of topological data analysis, to study electoral redistricting. begin by combining geographic and a districting plan produce persistence diagram. Then, see beyond particular understand possibilities afforded choices made in redistricting, we build methods visualize analyze large ensembles alternative plans. Our detailed case studies use zero-dimensional homology (persistent components) filtered graphs constructed voting redistricting Pennsylvania North Carolina. find that, across partitions, features cluster diagrams way that corresponds strongly location, so can construct an average diagram for ensemble, with each point identified geographical region. Using this localization lets us zonings state at Congressional, Senate, House scales, show regional non-uniformity election shifts, identify attributes partitions tend correspond partisan advantage.The here are set up be broadly applicable TDA on data. Many will benefit interpretable summaries sets samples or simulations, work zoning readily generalize other partition problems, which abundant scientific applications. For mathematically politically rich problem particular, provides powerful elegant summarization whose findings useful practitioners.
منابع مشابه
The behavior of homological dimensions
Let R be a commutative noetherian ring. We study the behavior of injectiveand at dimension of R-modules under the functors HomR(-,-) and -×R-.
متن کاملStochastic Study of Gerrymandering
In the 2012 election for the US House of Representatives, only four of North Carolina’s thirteen congressional districts elected a democrat, despite a majority democratic vote. This raises the question of whether gerrymandering, the process of drawing districts to favor a political party, was employed. This study explores election outcomes under different choices of district boundaries. We repr...
متن کاملThe study of a new gerrymandering methodology
This paper is to obtain a simple dividing-diagram of the congressional districts, where the only limit is that each district should contain the same population if possibly. In order to solve this problem, we introduce three different standards of the ”simple” shape. The first standard is that the final shape of the congressional districts should be of a simplest figure and we apply a modified ”...
متن کاملPartisan and Bipartisan Gerrymandering∗
This paper analyzes the optimal partisan and bipartisan gerrymandering policies in a model with electoral competitions in policy positions and transfer promises. With complete freedom in redistricting, partisan gerrymandering policy generates the most one-sidedly biased district profile, while bipartisan gerrymandering generates the most polarized district profile. In contrast, with limited fre...
متن کاملGerrymandering, Sandwiches, and Topology
In May, I gave a talk about fair division problems in a seminar. These are the kind of mathematical results that you would use if, for example, you wanted to divide rent fairly with your roommates, split a cake so that no one is envious of another person’s piece, or distribute a stolen necklace among your fellow thieves. I was asked if those results could be used to “solve gerrymandering.” I wa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations of data science
سال: 2022
ISSN: ['2639-8001']
DOI: https://doi.org/10.3934/fods.2021007